Subexponential Asymptotics of a Network Multiplexer
نویسندگان
چکیده
For a Markov-modulated random walk with negative drift and long-tailed right tail we prove that the ascending ladder height matrix distribution is asymptotically proportional to a long-tailed distribution. This result enable us to generalize a recent result on subexponential asymptotics of a Markov-modulated M/G/1 queue to subexponential asymptotics of a Markov-modulated G/G/1 queue. For a class of processes constructed by embedding a Markov chain into a subexponential renewal process we prove that the autocorrelation function has a subexponential tail. Furthermore, we prove that when a fluid flow queue is fed by these processes the queue length distribution is asymptotically proportional to its autocorrelation function.
منابع مشابه
A Network Multiplexer with Multiple Time Scale and Subexponential Arrivals
Real-time traffic processes, such as video, exhibit multiple time scale characteristics, as well as subexponential first and second order statistics. We present recent results on evaluating the asymptotic behavior of a network multiplexer that is loaded with such processes.
متن کاملReferences 36 Pam96] M. Parulekar and A. M. Makowski, \tail Probabilitites for a Multiplexer with Self-similar Traac," References 35 Duc95] N. G. Duueld and N. O'connell, \large Deviations and Overrow Probabilities for the General Single-server Queue with Applications," Mathematical
Samorodnitsky, \Heavy tails and long range dependence in on/oo processes and associated uid models," preprint. JLA95g] P. R. Jelenkovi c and A. A. Lazar, \Subexponential asymptotics of a Markov-modulated random walk with queueing applications," \Stochastic theory of a data handling system with multiple sources," Bell Syst. Techn. \Tail probabilities for non-standard risk and queueing processes ...
متن کاملAsymptotics of Closed Fork and Join Queues with Subexponential Service Times
We consider a closed fork and join queueing network where several lines feed a single assembly station. Under the assumption that at least one service time distribution is subexponential, we obtain the tail asymptotics of transient cycle times and waiting times. We also discuss under which conditions these results can be generalized to the tail asymptotics of stationary cycle times and waiting ...
متن کاملSubexponential Asymptotics of the Stationary Distributions of GI/G/1-Type Markov Chains
2 This paper considers the subexponential asymptotics of the stationary distributions of GI/G/1-type Markov chains in two cases: (i) the phase transition matrix in non-boundary levels is stochastic; and (ii) it is strictly substochastic. For the case (i), we present a weaker sufficient condition for the subexponential asymptotics than those given in the literature. As for the case (ii), the sub...
متن کاملReferences C: Finite Number of Subexponential On-oo Sources: Upper Bound
50 KAR30] J. Karamata, \Sur un mode de croissance r eguili ere des fonctions," Mathematica (Cluj), 1930. \Tail probabilities for M/G/1 input processes (i): Preliminary asymptotics," preprint. RES96] S. Resnick and G. Samorodnitsky, \Performance decay in a single server queueing model with long range dependence," preprint. References 49 COH73] J. W. Cohen, \Some results on regular variation for ...
متن کامل